AN APPRAISAL ALGORITHM FOR TESTS OF DIVISIBILITY USING MODULAR ARITHMETIC

Knowledge to execute wild conceptual mathematical computations helped immensely even out of the park. Knowing these quick calculations has been great interest ever since. Divisibility tests were required know whether a number (large enough) was divisible by given integer or not? Let 0,m  and be any integer. The symbol, mod , am used represent residue when divided m. In this piece treatised work, modulo theory employed find divisibilty for numbers < 60 elaborated use modular arithmetic from in finding different divisibility. Particularly, b adic expension an N its congruence characterise regarding divisibility rule. One characterisations stated proved that 40 if only if0 1 2 10( ) was 40, where 0 ,, awere digits decimal representation. Finally, framework proposed reduced pitfalls demonstating each established rule with help their recursive applications on large integers.